Optimal control, statistics and path planning
نویسندگان
چکیده
منابع مشابه
Optimal Control for Constrained Coverage Path Planning
The problem of constrained coverage path planning involves a robot trying to cover maximum area of an environment under some constraints that appear as obstacles in the map. Out of the several coverage path planning methods, we consider augmenting the linear sweep-based coverage method to achieve minimum energy/ time optimality along with maximum area coverage. In addition, we also study the ef...
متن کاملOptimal path planning
This paper addresses the problem of optimizing the navigation of an intelligent mobile in a real world enviroanment described by a map The map is composed of features representing natural landmarks in the environment. The vehicle is equipped with a sensor which allows it to obtain range and bearing measurements from observed landmarks durinq the execution. These measurements are correlated with...
متن کاملDiscrete Optimal View Path Planning
This paper presents a discrete model of a sensor path planning problem, with a long-term planning horizon. The goal is to minimize the covariance of the reconstructed structures while meeting constraints on the length of the traversed path of the sensor. The sensor is restricted to move on a graph representing a discrete set of configurations, and additional constraints can be incorporated by a...
متن کاملVisibility-based Optimal Path and Motion Planning
No wonder you activities are, reading will be always needed. It is not only to fulfil the duties that you need to finish in deadline time. Reading will encourage your mind and thoughts. Of course, reading will greatly develop your experiences about everything. Reading visibility based optimal path and motion planning is also a way as one of the collective books that gives many advantages. The a...
متن کاملOptimal robust path planning in general environments
We address robust path planning for a mobile agent in a general environment by finding minimum cost source-destination paths having prescribed widths. The main result is a new approach that optimally solves the robust path planning problem using an efficient network flow formulation. Our algorithm represents a significant departure from conventional shortest-path or graph search based methods; ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2001
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(00)00241-7